#include <iostream>
#include "tree.h"
#include <vector>

using namespace std;

int main() {
    vector<int> preorder = {3,9,20,15,7};
    vector<int> inorder = {9,3,15,20,7};

    tree t;
    t.build(preorder,inorder);

    t.preorderTraversal();
    cout<<endl;
    t.inorderTraversal();
    cout<<endl;
    t.postorderTraversal();
    cout<<endl;
    t.levelTraversal();

}
